
/*  A Bison parser, made from dtd1.y with Bison version GNU Bison version 1.22
  */

#define YYBISON 1  /* Identify Bison output.  */

#define	SGML	258
#define	COND	259
#define	ENTSTART	260
#define	QUOTE	261
#define	ELESTART	262
#define	ATTSTART	263
#define	WORD	264
#define	ENTITY	265
#define	COMMENTEND	266

#line 1 "dtd1.y"

#include <stdio.h>
#include <malloc.h>		/* added by NPM */
/* #define DEBUG */
/* NPM: removed this extern char *calloc(); */

/*
 * Read the information at the beginning of dtd1.l for
 * more information about this program.
 */

/*
 * Structure used to create a linked list of entities including
 * their key and data.
 */
static struct entityDef {
    char *key;
    char *data;
    struct entityDef *next;		/* For table insertion */
    struct entityDef *prev;		/* For table insertion */
} *topEntList, *bottomEntList, *saveEntList;

/*
 * Structure used to create a linked list of the SGML markups
 * found in the dtd.  Currently only ENTITY and ATTLIST are supported.
 */
static struct SGMLitem {
    char *str;		/* Will change to include ENTITY and ATTLIST later */
    struct SGMLitem *next;
    struct SGMLitem *prev;		/* For table insertion */
} *topSGMLList, *bottomSGMLList, *saveSGMLList;

extern int yygetlineno();
void yyerror(char *s);

static void addEntTable(struct entityDef *new);
static char *LookupEnt(char *key);
static struct entityDef *newEntity(char *key, char *data);
static void DumpEntTable();
static void FreeEntTable();

static void addSGMLTable(struct SGMLitem *new);
static struct SGMLitem *newSGML(char *string);
static void DumpSGMLTable();

#define SGMLTYPE	1
#define ENTDEFTYPE	2

#line 50 "dtd1.y"
typedef union {
    char *string;
    int option;
    struct entityDef *entitydef;
    struct SGMLitem *sgmlitem;
    int sgmltype;		/* SGMLTYPE or ENTDEFTYPE */
} YYSTYPE;

#ifndef YYLTYPE
typedef
  struct yyltype
    {
      int timestamp;
      int first_line;
      int first_column;
      int last_line;
      int last_column;
      char *text;
   }
  yyltype;

#define YYLTYPE yyltype
#endif

#include <stdio.h>

#ifndef __cplusplus
#ifndef __STDC__
#define const
#endif
#endif



#define	YYFINAL		66
#define	YYFLAG		-32768
#define	YYNTBASE	16

#define YYTRANSLATE(x) ((unsigned)(x) <= 266 ? yytranslate[x] : 29)

static const char yytranslate[] = {     0,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,    15,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,    12,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
    13,     2,    14,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
     2,     2,     2,     2,     2,     1,     2,     3,     4,     5,
     6,     7,     8,     9,    10,    11
};

#if YYDEBUG != 0
static const short yyprhs[] = {     0,
     0,     2,     5,     7,     9,    11,    13,    16,    18,    20,
    22,    26,    30,    33,    38,    42,    44,    47,    49,    51,
    53,    55,    57,    60,    62,    64,    72,    78,    84,    90,
    95,    99,   106,   113,   119,   125,   129,   132,   136
};

static const short yyrhs[] = {    17,
     0,    16,    17,     0,     1,     0,    18,     0,    26,     0,
    19,     0,    18,    19,     0,    20,     0,    27,     0,    10,
     0,     7,    21,    23,     0,     8,    21,    23,     0,     3,
    23,     0,     3,     9,    21,    23,     0,     3,     9,     1,
     0,    22,     0,    21,    22,     0,    24,     0,    28,     0,
    12,     0,    11,     0,    25,     0,    24,    25,     0,     9,
     0,    10,     0,     4,    25,    13,    18,    14,    14,    12,
     0,     5,    15,     9,    28,    12,     0,     5,    15,     9,
    28,    11,     0,     5,    15,     9,    28,     1,     0,     5,
    15,     9,     1,     0,     5,    15,     1,     0,     5,    15,
     9,     9,    28,    12,     0,     5,    15,     9,     9,    28,
    11,     0,     5,     9,     9,    28,    12,     0,     5,     9,
     9,    28,    11,     0,     6,    24,     6,     0,     6,     6,
     0,     6,    24,     1,     0,     6,     1,     0
};

#endif

#if YYDEBUG != 0
static const short yyrline[] = { 0,
    68,    71,    74,    80,    81,    83,   111,   115,   130,   146,
   161,   169,   177,   185,   196,   204,   208,   216,   220,   226,
   227,   230,   239,   251,   255,   269,   295,   299,   303,   312,
   320,   326,   331,   341,   351,   363,   372,   379,   383
};

static const char * const yytname[] = {   "$","error","$illegal.","SGML","COND",
"ENTSTART","QUOTE","ELESTART","ATTSTART","WORD","ENTITY","COMMENTEND","'>'",
"'['","']'","'%'","top","line","sgmllist","sgmllistitem","sgml","sgmlcontent",
"sgmlcontentitem","sgmlend","words","word","cond","entdef","qstring",""
};
#endif

static const short yyr1[] = {     0,
    16,    16,    16,    17,    17,    18,    18,    19,    19,    19,
    20,    20,    20,    20,    20,    21,    21,    22,    22,    23,
    23,    24,    24,    25,    25,    26,    27,    27,    27,    27,
    27,    27,    27,    27,    27,    28,    28,    28,    28
};

static const short yyr2[] = {     0,
     1,     2,     1,     1,     1,     1,     2,     1,     1,     1,
     3,     3,     2,     4,     3,     1,     2,     1,     1,     1,
     1,     1,     2,     1,     1,     7,     5,     5,     5,     4,
     3,     6,     6,     5,     5,     3,     2,     3,     2
};

static const short yydefact[] = {     0,
     3,     0,     0,     0,     0,     0,    10,     0,     1,     4,
     6,     8,     5,     9,     0,    21,    20,    13,    24,    25,
     0,     0,     0,     0,     0,    16,    18,    22,    19,     0,
     2,     7,    15,     0,     0,     0,    31,     0,    39,    37,
     0,    17,    11,    23,    12,    14,     0,     0,    30,     0,
     0,    38,    36,     0,    35,    34,     0,    29,    28,    27,
     0,    33,    32,    26,     0,     0
};

static const short yydefgoto[] = {     8,
     9,    10,    11,    12,    25,    26,    18,    27,    28,    13,
    14,    29
};

static const short yypact[] = {    39,
-32768,    72,    11,     8,    25,    25,-32768,    22,-32768,    65,
-32768,-32768,-32768,-32768,    27,-32768,-32768,-32768,-32768,-32768,
    28,    43,    60,    44,    68,-32768,    11,-32768,-32768,    68,
-32768,-32768,-32768,    68,    65,    42,-32768,     5,-32768,-32768,
    50,-32768,-32768,-32768,-32768,-32768,     2,    53,-32768,    42,
     7,-32768,-32768,    41,-32768,-32768,    74,-32768,-32768,-32768,
    59,-32768,-32768,-32768,    76,-32768
};

static const short yypgoto[] = {-32768,
    79,    47,    -8,-32768,    -2,    32,    33,    64,    -3,-32768,
-32768,   -35
};


#define	YYLAST		88


static const short yytable[] = {    21,
    48,    32,    51,    30,     2,    49,     4,    58,     5,     6,
    24,     7,    34,    50,    57,    54,    22,    59,    60,    19,
    20,    65,    23,    44,     2,     3,     4,    33,     5,     6,
    24,     7,    24,    19,    20,    19,    20,    44,    32,     1,
    35,     2,     3,     4,    39,     5,     6,    24,     7,    40,
    52,    36,    19,    20,    61,    53,    42,    43,    19,    20,
    37,    42,    45,    55,    56,    42,    46,     2,    38,     4,
    64,     5,     6,    24,     7,    66,    19,    20,    16,    17,
    15,    47,    16,    17,    62,    63,    31,    41
};

static const short yycheck[] = {     3,
    36,    10,    38,     6,     3,     1,     5,     1,     7,     8,
     6,    10,    15,     9,    50,    14,     9,    11,    12,     9,
    10,     0,    15,    27,     3,     4,     5,     1,     7,     8,
     6,    10,     6,     9,    10,     9,    10,    41,    47,     1,
    13,     3,     4,     5,     1,     7,     8,     6,    10,     6,
     1,     9,     9,    10,    14,     6,    25,    25,     9,    10,
     1,    30,    30,    11,    12,    34,    34,     3,     9,     5,
    12,     7,     8,     6,    10,     0,     9,    10,    11,    12,
     9,    35,    11,    12,    11,    12,     8,    24
};
/* -*-C-*-  Note some compilers choke on comments on `#line' lines.  */
#line 3 "/usr/lib/bison.simple"

/* Skeleton output parser for bison,
   Copyright (C) 1984, 1989, 1990 Bob Corbett and Richard Stallman

   This program is free software; you can redistribute it and/or modify
   it under the terms of the GNU General Public License as published by
   the Free Software Foundation; either version 1, or (at your option)
   any later version.

   This program is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
   GNU General Public License for more details.

   You should have received a copy of the GNU General Public License
   along with this program; if not, write to the Free Software
   Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.  */


#ifndef alloca
#ifdef __GNUC__
#define alloca __builtin_alloca
#else /* not GNU C.  */
#if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi)
#include <alloca.h>
#else /* not sparc */
#if defined (MSDOS) && !defined (__TURBOC__)
#include <malloc.h>
#else /* not MSDOS, or __TURBOC__ */
#if defined(_AIX)
#include <malloc.h>
 #pragma alloca
#else /* not MSDOS, __TURBOC__, or _AIX */
#ifdef __hpux
#ifdef __cplusplus
extern "C" {
void *alloca (unsigned int);
};
#else /* not __cplusplus */
void *alloca ();
#endif /* not __cplusplus */
#endif /* __hpux */
#endif /* not _AIX */
#endif /* not MSDOS, or __TURBOC__ */
#endif /* not sparc.  */
#endif /* not GNU C.  */
#endif /* alloca not defined.  */

/* This is the parser code that is written into each bison parser
  when the %semantic_parser declaration is not specified in the grammar.
  It was written by Richard Stallman by simplifying the hairy parser
  used when %semantic_parser is specified.  */

/* Note: there must be only one dollar sign in this file.
   It is replaced by the list of actions, each action
   as one case of the switch.  */

#define yyerrok		(yyerrstatus = 0)
#define yyclearin	(yychar = YYEMPTY)
#define YYEMPTY		-2
#define YYEOF		0
#define YYACCEPT	return(0)
#define YYABORT 	return(1)
#define YYERROR		goto yyerrlab1
/* Like YYERROR except do call yyerror.
   This remains here temporarily to ease the
   transition to the new meaning of YYERROR, for GCC.
   Once GCC version 2 has supplanted version 1, this can go.  */
#define YYFAIL		goto yyerrlab
#define YYRECOVERING()  (!!yyerrstatus)
#define YYBACKUP(token, value) \
do								\
  if (yychar == YYEMPTY && yylen == 1)				\
    { yychar = (token), yylval = (value);			\
      yychar1 = YYTRANSLATE (yychar);				\
      YYPOPSTACK;						\
      goto yybackup;						\
    }								\
  else								\
    { yyerror ("syntax error: cannot back up"); YYERROR; }	\
while (0)

#define YYTERROR	1
#define YYERRCODE	256

#ifndef YYPURE
#define YYLEX		yylex()
#endif

#ifdef YYPURE
#ifdef YYLSP_NEEDED
#define YYLEX		yylex(&yylval, &yylloc)
#else
#define YYLEX		yylex(&yylval)
#endif
#endif

/* If nonreentrant, generate the variables here */

#ifndef YYPURE

int	yychar;			/*  the lookahead symbol		*/
YYSTYPE	yylval;			/*  the semantic value of the		*/
				/*  lookahead symbol			*/

#ifdef YYLSP_NEEDED
YYLTYPE yylloc;			/*  location data for the lookahead	*/
				/*  symbol				*/
#endif

int yynerrs;			/*  number of parse errors so far       */
#endif  /* not YYPURE */

#if YYDEBUG != 0
int yydebug;			/*  nonzero means print parse trace	*/
/* Since this is uninitialized, it does not stop multiple parsers
   from coexisting.  */
#endif

/*  YYINITDEPTH indicates the initial size of the parser's stacks	*/

#ifndef	YYINITDEPTH
#define YYINITDEPTH 200
#endif

/*  YYMAXDEPTH is the maximum size the stacks can grow to
    (effective only if the built-in stack extension method is used).  */

#if YYMAXDEPTH == 0
#undef YYMAXDEPTH
#endif

#ifndef YYMAXDEPTH
#define YYMAXDEPTH 10000
#endif

/* Prevent warning if -Wstrict-prototypes.  */
#ifdef __GNUC__
int yyparse (void);
#endif

#if __GNUC__ > 1		/* GNU C and GNU C++ define this.  */
#define __yy_bcopy(FROM,TO,COUNT)	__builtin_memcpy(TO,FROM,COUNT)
#else				/* not GNU C or C++ */
#ifndef __cplusplus

/* This is the most reliable way to avoid incompatibilities
   in available built-in functions on various systems.  */
static void
__yy_bcopy (from, to, count)
     char *from;
     char *to;
     int count;
{
  register char *f = from;
  register char *t = to;
  register int i = count;

  while (i-- > 0)
    *t++ = *f++;
}

#else /* __cplusplus */

/* This is the most reliable way to avoid incompatibilities
   in available built-in functions on various systems.  */
static void
__yy_bcopy (char *from, char *to, int count)
{
  register char *f = from;
  register char *t = to;
  register int i = count;

  while (i-- > 0)
    *t++ = *f++;
}

#endif
#endif

#line 184 "/usr/lib/bison.simple"
int
yyparse()
{
  register int yystate;
  register int yyn;
  register short *yyssp;
  register YYSTYPE *yyvsp;
  int yyerrstatus;	/*  number of tokens to shift before error messages enabled */
  int yychar1 = 0;		/*  lookahead token as an internal (translated) token number */

  short	yyssa[YYINITDEPTH];	/*  the state stack			*/
  YYSTYPE yyvsa[YYINITDEPTH];	/*  the semantic value stack		*/

  short *yyss = yyssa;		/*  refer to the stacks thru separate pointers */
  YYSTYPE *yyvs = yyvsa;	/*  to allow yyoverflow to reallocate them elsewhere */

#ifdef YYLSP_NEEDED
  YYLTYPE yylsa[YYINITDEPTH];	/*  the location stack			*/
  YYLTYPE *yyls = yylsa;
  YYLTYPE *yylsp;

#define YYPOPSTACK   (yyvsp--, yyssp--, yylsp--)
#else
#define YYPOPSTACK   (yyvsp--, yyssp--)
#endif

  int yystacksize = YYINITDEPTH;

#ifdef YYPURE
  int yychar;
  YYSTYPE yylval;
  int yynerrs;
#ifdef YYLSP_NEEDED
  YYLTYPE yylloc;
#endif
#endif

  YYSTYPE yyval;		/*  the variable used to return		*/
				/*  semantic values from the action	*/
				/*  routines				*/

  int yylen;

#if YYDEBUG != 0
  if (yydebug)
    fprintf(stderr, "Starting parse\n");
#endif

  yystate = 0;
  yyerrstatus = 0;
  yynerrs = 0;
  yychar = YYEMPTY;		/* Cause a token to be read.  */

  /* Initialize stack pointers.
     Waste one element of value and location stack
     so that they stay on the same level as the state stack.
     The wasted elements are never initialized.  */

  yyssp = yyss - 1;
  yyvsp = yyvs;
#ifdef YYLSP_NEEDED
  yylsp = yyls;
#endif

/* Push a new state, which is found in  yystate  .  */
/* In all cases, when you get here, the value and location stacks
   have just been pushed. so pushing a state here evens the stacks.  */
yynewstate:

  *++yyssp = yystate;

  if (yyssp >= yyss + yystacksize - 1)
    {
      /* Give user a chance to reallocate the stack */
      /* Use copies of these so that the &'s don't force the real ones into memory. */
      YYSTYPE *yyvs1 = yyvs;
      short *yyss1 = yyss;
#ifdef YYLSP_NEEDED
      YYLTYPE *yyls1 = yyls;
#endif

      /* Get the current used size of the three stacks, in elements.  */
      int size = yyssp - yyss + 1;

#ifdef yyoverflow
      /* Each stack pointer address is followed by the size of
	 the data in use in that stack, in bytes.  */
#ifdef YYLSP_NEEDED
      /* This used to be a conditional around just the two extra args,
	 but that might be undefined if yyoverflow is a macro.  */
      yyoverflow("parser stack overflow",
		 &yyss1, size * sizeof (*yyssp),
		 &yyvs1, size * sizeof (*yyvsp),
		 &yyls1, size * sizeof (*yylsp),
		 &yystacksize);
#else
      yyoverflow("parser stack overflow",
		 &yyss1, size * sizeof (*yyssp),
		 &yyvs1, size * sizeof (*yyvsp),
		 &yystacksize);
#endif

      yyss = yyss1; yyvs = yyvs1;
#ifdef YYLSP_NEEDED
      yyls = yyls1;
#endif
#else /* no yyoverflow */
      /* Extend the stack our own way.  */
      if (yystacksize >= YYMAXDEPTH)
	{
	  yyerror("parser stack overflow");
	  return 2;
	}
      yystacksize *= 2;
      if (yystacksize > YYMAXDEPTH)
	yystacksize = YYMAXDEPTH;
      yyss = (short *) alloca (yystacksize * sizeof (*yyssp));
      __yy_bcopy ((char *)yyss1, (char *)yyss, size * sizeof (*yyssp));
      yyvs = (YYSTYPE *) alloca (yystacksize * sizeof (*yyvsp));
      __yy_bcopy ((char *)yyvs1, (char *)yyvs, size * sizeof (*yyvsp));
#ifdef YYLSP_NEEDED
      yyls = (YYLTYPE *) alloca (yystacksize * sizeof (*yylsp));
      __yy_bcopy ((char *)yyls1, (char *)yyls, size * sizeof (*yylsp));
#endif
#endif /* no yyoverflow */

      yyssp = yyss + size - 1;
      yyvsp = yyvs + size - 1;
#ifdef YYLSP_NEEDED
      yylsp = yyls + size - 1;
#endif

#if YYDEBUG != 0
      if (yydebug)
	fprintf(stderr, "Stack size increased to %d\n", yystacksize);
#endif

      if (yyssp >= yyss + yystacksize - 1)
	YYABORT;
    }

#if YYDEBUG != 0
  if (yydebug)
    fprintf(stderr, "Entering state %d\n", yystate);
#endif

  goto yybackup;
 yybackup:

/* Do appropriate processing given the current state.  */
/* Read a lookahead token if we need one and don't already have one.  */
/* yyresume: */

  /* First try to decide what to do without reference to lookahead token.  */

  yyn = yypact[yystate];
  if (yyn == YYFLAG)
    goto yydefault;

  /* Not known => get a lookahead token if don't already have one.  */

  /* yychar is either YYEMPTY or YYEOF
     or a valid token in external form.  */

  if (yychar == YYEMPTY)
    {
#if YYDEBUG != 0
      if (yydebug)
	fprintf(stderr, "Reading a token: ");
#endif
      yychar = YYLEX;
    }

  /* Convert token to internal form (in yychar1) for indexing tables with */

  if (yychar <= 0)		/* This means end of input. */
    {
      yychar1 = 0;
      yychar = YYEOF;		/* Don't call YYLEX any more */

#if YYDEBUG != 0
      if (yydebug)
	fprintf(stderr, "Now at end of input.\n");
#endif
    }
  else
    {
      yychar1 = YYTRANSLATE(yychar);

#if YYDEBUG != 0
      if (yydebug)
	{
	  fprintf (stderr, "Next token is %d (%s", yychar, yytname[yychar1]);
	  /* Give the individual parser a way to print the precise meaning
	     of a token, for further debugging info.  */
#ifdef YYPRINT
	  YYPRINT (stderr, yychar, yylval);
#endif
	  fprintf (stderr, ")\n");
	}
#endif
    }

  yyn += yychar1;
  if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1)
    goto yydefault;

  yyn = yytable[yyn];

  /* yyn is what to do for this token type in this state.
     Negative => reduce, -yyn is rule number.
     Positive => shift, yyn is new state.
       New state is final state => don't bother to shift,
       just return success.
     0, or most negative number => error.  */

  if (yyn < 0)
    {
      if (yyn == YYFLAG)
	goto yyerrlab;
      yyn = -yyn;
      goto yyreduce;
    }
  else if (yyn == 0)
    goto yyerrlab;

  if (yyn == YYFINAL)
    YYACCEPT;

  /* Shift the lookahead token.  */

#if YYDEBUG != 0
  if (yydebug)
    fprintf(stderr, "Shifting token %d (%s), ", yychar, yytname[yychar1]);
#endif

  /* Discard the token being shifted unless it is eof.  */
  if (yychar != YYEOF)
    yychar = YYEMPTY;

  *++yyvsp = yylval;
#ifdef YYLSP_NEEDED
  *++yylsp = yylloc;
#endif

  /* count tokens shifted since error; after three, turn off error status.  */
  if (yyerrstatus) yyerrstatus--;

  yystate = yyn;
  goto yynewstate;

/* Do the default action for the current state.  */
yydefault:

  yyn = yydefact[yystate];
  if (yyn == 0)
    goto yyerrlab;

/* Do a reduction.  yyn is the number of a rule to reduce with.  */
yyreduce:
  yylen = yyr2[yyn];
  if (yylen > 0)
    yyval = yyvsp[1-yylen]; /* implement default value of the action */

#if YYDEBUG != 0
  if (yydebug)
    {
      int i;

      fprintf (stderr, "Reducing via rule %d (line %d), ",
	       yyn, yyrline[yyn]);

      /* Print the symbols being reduced, and their result.  */
      for (i = yyprhs[yyn]; yyrhs[i] > 0; i++)
	fprintf (stderr, "%s ", yytname[yyrhs[i]]);
      fprintf (stderr, " -> %s\n", yytname[yyr1[yyn]]);
    }
#endif


  switch (yyn) {

case 1:
#line 69 "dtd1.y"
{
		    ;
    break;}
case 2:
#line 72 "dtd1.y"
{
		    ;
    break;}
case 3:
#line 75 "dtd1.y"
{
			fprintf(stderr, "%d: syntax error\n", yygetlineno());
		    ;
    break;}
case 6:
#line 84 "dtd1.y"
{
			/*
			 * First item in the list.
			 * We need to save the state of the entity table
			 * and the SGML list so we can back out our changes
			 * if we are in a conditional and it proves to be
			 * an IGNORE. This global hack does limit us to one
			 * level of depth on conditional SGMLs.
			 *
			 * Note that by now the first Entity or SGML 
			 * has been added to the list, so we have to
			 * use the previous when we save the state of that
			 * list.
			 */
			if (bottomEntList) {
			    if (yyvsp[0].sgmltype == ENTDEFTYPE)
				saveEntList = bottomEntList->prev;
			    else
				saveEntList = bottomEntList;
			}
			if (bottomSGMLList) {
			    if (yyvsp[0].sgmltype == SGMLTYPE)
				saveSGMLList = bottomSGMLList->prev;
			    else
				saveSGMLList = bottomSGMLList;
			}
		    ;
    break;}
case 8:
#line 116 "dtd1.y"
{
			/*
			 * We have a complete SGML statement.
			 * Save it in the SGML list (table).
			 */
			if (yyvsp[0].sgmlitem) {
#ifdef DEBUG
			    fprintf(stderr, "New SGML %s\n",
				    yyvsp[0].sgmlitem->str);
#endif
			    addSGMLTable(yyvsp[0].sgmlitem);
			}
			yyval.sgmltype = SGMLTYPE;
		    ;
    break;}
case 9:
#line 131 "dtd1.y"
{
			/*
			 * We have defined an entity.
			 * Save it in the Entity list (table).
			 */
			if (yyvsp[0].entitydef) {
#ifdef DEBUG
			    fprintf(stderr, "New Entity %s: %s\n",
				    yyvsp[0].entitydef->key,
				    yyvsp[0].entitydef->data);
#endif
			    addEntTable(yyvsp[0].entitydef);
			}
			yyval.sgmltype = ENTDEFTYPE;
		    ;
    break;}
case 10:
#line 147 "dtd1.y"
{
			/*
			 * There are cases in the dtd where we get lines like:
			 * 		%ISOlat1;
			 * in the dtd.  We just print a warning and ignore
			 * these lines.
			 */
			fprintf(stderr, "%d: Ignoring single line entity: %s\n",
				yygetlineno(),
				yyvsp[0].string);
			yyval.sgmltype = 0;
		    ;
    break;}
case 11:
#line 162 "dtd1.y"
{
			char *str = malloc(4096);

			sprintf(str, "<!ELEMENT %s>", yyvsp[-1].string);
			free (yyvsp[-1].string);
			yyval.sgmlitem = newSGML(str);
		    ;
    break;}
case 12:
#line 170 "dtd1.y"
{
			char *str = malloc(4096);

			sprintf(str, "<!ATTLIST %s>", yyvsp[-1].string);
			free (yyvsp[-1].string);
			yyval.sgmlitem = newSGML(str);
		    ;
    break;}
case 13:
#line 178 "dtd1.y"
{
			/* Empty sgml -- probably an eaten comment */
			yyval.sgmlitem = 0;
			/*
			sprintf($$, "<!-- deleted comment -->");
			*/
		    ;
    break;}
case 14:
#line 186 "dtd1.y"
{
			char *str = malloc(4096);

			sprintf(str, "<!%s %s>", yyvsp[-2].string, yyvsp[-1].string);
			yyval.sgmlitem = newSGML(str);
			fprintf(stderr, "Unknown SGML passed through: %s\n",
				yyvsp[-2].string);
			free (yyvsp[-2].string);
			free (yyvsp[-1].string);
		    ;
    break;}
case 15:
#line 197 "dtd1.y"
{
			fprintf(stderr, "Unknown SGML ignored: %s\n", yyvsp[-1].string);
			free(yyvsp[-1].string);
			yyval.sgmlitem = 0;
		    ;
    break;}
case 16:
#line 205 "dtd1.y"
{
			yyval.string = yyvsp[0].string;
		    ;
    break;}
case 17:
#line 209 "dtd1.y"
{
			strcat(yyval.string, " ");
			strcat(yyval.string, yyvsp[0].string);
			free(yyvsp[0].string);
		    ;
    break;}
case 18:
#line 217 "dtd1.y"
{
			yyval.string = yyvsp[0].string;
		    ;
    break;}
case 19:
#line 221 "dtd1.y"
{
			yyval.string = yyvsp[0].string;
		    ;
    break;}
case 22:
#line 231 "dtd1.y"
{
			yyval.string = calloc(1, 4096);
			strcat(yyval.string, yyvsp[0].string);
			free(yyvsp[0].string);
			/*
			fprintf(stderr, "Starting words: %s\n", $$);
			*/
		    ;
    break;}
case 23:
#line 240 "dtd1.y"
{
			yyval.string = yyvsp[-1].string;
			strcat(yyval.string, " ");
			strcat(yyval.string, yyvsp[0].string);
			free(yyvsp[0].string);
			/*
			fprintf(stderr, "Adding to words: %s\n", $$);
			*/
		    ;
    break;}
case 24:
#line 252 "dtd1.y"
{
			yyval.string = yyvsp[0].string;
		    ;
    break;}
case 25:
#line 256 "dtd1.y"
{
			char *ent = LookupEnt(yyvsp[0].string);
			if (ent == NULL) {
			    fprintf(stderr, "%d: Unknown Entity: %s\n",
				    yygetlineno(), yyvsp[0].string);
			    yyval.string = calloc(1, 1);
			}
			else {
			    yyval.string = (char *)strdup(ent);
			}
		    ;
    break;}
case 26:
#line 270 "dtd1.y"
{
			/*
			 * We have to read in the entire list before
			 * we evaluate the conditional.  Because of
			 * this, we may have added entities and SGMLS
			 * to the those lists which we want to get
			 * rid of.  That's what happens here.
			 */
			if (strcmp(yyvsp[-5].string, "IGNORE") == 0) {
			    /* Reset the lists to ignore the contents */
			    if (saveEntList) {
				saveEntList->next = 0;	/* Lose data */
				bottomEntList = saveEntList;
			    }
			    /* else error XXX */

			    if (saveSGMLList) {
				saveSGMLList->next = 0;
				bottomSGMLList = saveSGMLList;
			    }
			    /* else error XXX */
			}
		    ;
    break;}
case 27:
#line 296 "dtd1.y"
{
			yyval.entitydef = newEntity(yyvsp[-2].string, yyvsp[-1].string);
		    ;
    break;}
case 28:
#line 300 "dtd1.y"
{
			yyval.entitydef = newEntity(yyvsp[-2].string, yyvsp[-1].string);
		    ;
    break;}
case 29:
#line 304 "dtd1.y"
{
			fprintf(stderr, "%d: incomplete entity: %s\n",
				yygetlineno(),
				yyvsp[-2].string);
			free(yyvsp[-2].string);
			free(yyvsp[-1].string);
			yyval.entitydef = 0;
		    ;
    break;}
case 30:
#line 313 "dtd1.y"
{
			fprintf(stderr, "%d: incomplete entity: %s\n",
				yygetlineno(),
				yyvsp[-1].string);
			free(yyvsp[-1].string);
			yyval.entitydef = 0;
		    ;
    break;}
case 31:
#line 321 "dtd1.y"
{
			fprintf(stderr, "%d: incomplete entity\n",
				yygetlineno());
			yyval.entitydef = 0;
		    ;
    break;}
case 32:
#line 327 "dtd1.y"
{
			yyval.entitydef = newEntity(yyvsp[-3].string, yyvsp[-1].string);
			free(yyvsp[-2].string);
		    ;
    break;}
case 33:
#line 332 "dtd1.y"
{
			fprintf(stderr, "%d: Ignoring entity %s\n",
				yygetlineno(),
				yyvsp[-3].string);
			free(yyvsp[-3].string);
			free(yyvsp[-2].string);
			free(yyvsp[-1].string);
			yyval.entitydef = 0;
		    ;
    break;}
case 34:
#line 342 "dtd1.y"
{
			fprintf(stderr, "%d: Ignoring entity %s\n",
				yygetlineno(),
				yyvsp[-2].string);
			free(yyvsp[-3].string);
			free(yyvsp[-2].string);
			free(yyvsp[-1].string);
			yyval.entitydef = 0;
		    ;
    break;}
case 35:
#line 352 "dtd1.y"
{
			fprintf(stderr, "%d: Ignoring entity %s\n",
				yygetlineno(),
				yyvsp[-3].string);
			free(yyvsp[-3].string);
			free(yyvsp[-2].string);
			free(yyvsp[-1].string);
			yyval.entitydef = 0;
		    ;
    break;}
case 36:
#line 364 "dtd1.y"
{
			yyval.string = calloc(1, 4096);
			sprintf(yyval.string, "\"%s\"", yyvsp[-1].string);
			free (yyvsp[-1].string);
			/*
			fprintf(stderr, "Got qstring: %s\n", $$);
			*/
		    ;
    break;}
case 37:
#line 373 "dtd1.y"
{
			sprintf(yyval.string, "\"\"");
			/*
			fprintf(stderr, "Got qstring: %s\n", $$);
			*/
		    ;
    break;}
case 38:
#line 380 "dtd1.y"
{
			fprintf(stderr, "%d: missing endquote\n", yygetlineno());
		    ;
    break;}
case 39:
#line 384 "dtd1.y"
{
			fprintf(stderr, "%d: incomplete quote\n", yygetlineno());
		    ;
    break;}
}
   /* the action file gets copied in in place of this dollarsign */
#line 465 "/usr/lib/bison.simple"

  yyvsp -= yylen;
  yyssp -= yylen;
#ifdef YYLSP_NEEDED
  yylsp -= yylen;
#endif

#if YYDEBUG != 0
  if (yydebug)
    {
      short *ssp1 = yyss - 1;
      fprintf (stderr, "state stack now");
      while (ssp1 != yyssp)
	fprintf (stderr, " %d", *++ssp1);
      fprintf (stderr, "\n");
    }
#endif

  *++yyvsp = yyval;

#ifdef YYLSP_NEEDED
  yylsp++;
  if (yylen == 0)
    {
      yylsp->first_line = yylloc.first_line;
      yylsp->first_column = yylloc.first_column;
      yylsp->last_line = (yylsp-1)->last_line;
      yylsp->last_column = (yylsp-1)->last_column;
      yylsp->text = 0;
    }
  else
    {
      yylsp->last_line = (yylsp+yylen-1)->last_line;
      yylsp->last_column = (yylsp+yylen-1)->last_column;
    }
#endif

  /* Now "shift" the result of the reduction.
     Determine what state that goes to,
     based on the state we popped back to
     and the rule number reduced by.  */

  yyn = yyr1[yyn];

  yystate = yypgoto[yyn - YYNTBASE] + *yyssp;
  if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp)
    yystate = yytable[yystate];
  else
    yystate = yydefgoto[yyn - YYNTBASE];

  goto yynewstate;

yyerrlab:   /* here on detecting error */

  if (! yyerrstatus)
    /* If not already recovering from an error, report this error.  */
    {
      ++yynerrs;

#ifdef YYERROR_VERBOSE
      yyn = yypact[yystate];

      if (yyn > YYFLAG && yyn < YYLAST)
	{
	  int size = 0;
	  char *msg;
	  int x, count;

	  count = 0;
	  /* Start X at -yyn if nec to avoid negative indexes in yycheck.  */
	  for (x = (yyn < 0 ? -yyn : 0);
	       x < (sizeof(yytname) / sizeof(char *)); x++)
	    if (yycheck[x + yyn] == x)
	      size += strlen(yytname[x]) + 15, count++;
	  msg = (char *) malloc(size + 15);
	  if (msg != 0)
	    {
	      strcpy(msg, "parse error");

	      if (count < 5)
		{
		  count = 0;
		  for (x = (yyn < 0 ? -yyn : 0);
		       x < (sizeof(yytname) / sizeof(char *)); x++)
		    if (yycheck[x + yyn] == x)
		      {
			strcat(msg, count == 0 ? ", expecting `" : " or `");
			strcat(msg, yytname[x]);
			strcat(msg, "'");
			count++;
		      }
		}
	      yyerror(msg);
	      free(msg);
	    }
	  else
	    yyerror ("parse error; also virtual memory exceeded");
	}
      else
#endif /* YYERROR_VERBOSE */
	yyerror("parse error");
    }

  goto yyerrlab1;
yyerrlab1:   /* here on error raised explicitly by an action */

  if (yyerrstatus == 3)
    {
      /* if just tried and failed to reuse lookahead token after an error, discard it.  */

      /* return failure if at end of input */
      if (yychar == YYEOF)
	YYABORT;

#if YYDEBUG != 0
      if (yydebug)
	fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]);
#endif

      yychar = YYEMPTY;
    }

  /* Else will try to reuse lookahead token
     after shifting the error token.  */

  yyerrstatus = 3;		/* Each real token shifted decrements this */

  goto yyerrhandle;

yyerrdefault:  /* current state does not do anything special for the error token. */

#if 0
  /* This is wrong; only states that explicitly want error tokens
     should shift them.  */
  yyn = yydefact[yystate];  /* If its default is to accept any token, ok.  Otherwise pop it.*/
  if (yyn) goto yydefault;
#endif

yyerrpop:   /* pop the current state because it cannot handle the error token */

  if (yyssp == yyss) YYABORT;
  yyvsp--;
  yystate = *--yyssp;
#ifdef YYLSP_NEEDED
  yylsp--;
#endif

#if YYDEBUG != 0
  if (yydebug)
    {
      short *ssp1 = yyss - 1;
      fprintf (stderr, "Error: state stack now");
      while (ssp1 != yyssp)
	fprintf (stderr, " %d", *++ssp1);
      fprintf (stderr, "\n");
    }
#endif

yyerrhandle:

  yyn = yypact[yystate];
  if (yyn == YYFLAG)
    goto yyerrdefault;

  yyn += YYTERROR;
  if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR)
    goto yyerrdefault;

  yyn = yytable[yyn];
  if (yyn < 0)
    {
      if (yyn == YYFLAG)
	goto yyerrpop;
      yyn = -yyn;
      goto yyreduce;
    }
  else if (yyn == 0)
    goto yyerrpop;

  if (yyn == YYFINAL)
    YYACCEPT;

#if YYDEBUG != 0
  if (yydebug)
    fprintf(stderr, "Shifting error token, ");
#endif

  *++yyvsp = yylval;
#ifdef YYLSP_NEEDED
  *++yylsp = yylloc;
#endif

  yystate = yyn;
  goto yynewstate;
}
#line 390 "dtd1.y"


extern FILE *yyin;

main()
{
    while (!feof(yyin)) {
	yyparse();
    }
    /*
    DumpEntTable();
    */

    /*
     * DumpSGMLTable() writes out the SGML table which is
     * now cleaned up and processed.
     */
    DumpSGMLTable();
    FreeEntTable();
    exit(0);
}

void
yyerror(char *s)
{
    fprintf(stderr, "%d: %s\n", yygetlineno(), s);
}


/***************** Entities ******************/


/*
 * Add a new entity to the entity list.
 */
static void
addEntTable(struct entityDef *new)
{
    /* Only first reference gets added to the table */
    char *cp = LookupEnt(new->key);
    if (cp == NULL) {
	if (topEntList == 0) {
	    topEntList = new;
	    bottomEntList = new;
	}
	else {
	    bottomEntList->next = new;
	    new->prev = bottomEntList;
	    bottomEntList = new;
	}
    }
    else {

#ifdef DEBUG
	fprintf(stderr, "\tIgnoring New Entity %s: %s\n",
		new->key,
		new->data);
#endif /* DEBUG */

	free(new->key);
	free(new->data);
	free(new);
    }
}

/*
 * Lookup an entity in the entity list.
 * To avoid memory and freeing problems, we save the value
 * with the existing quote at the beginning.  We have to
 * avoid it when we return the entity value.
 */
static char *
LookupEnt(char *key)
{
    struct entityDef *cur = topEntList;
    while (cur) {
	if (strcmp(cur->key, key) == 0)
	    return (cur->data + 1);		/* Skip first " */
	cur = cur->next;
    }
    return (NULL);
}

/*
 * Create a new entity.
 */
static struct entityDef *
newEntity(char *key, char *data)
{
    struct entityDef *new = (struct entityDef *)malloc(sizeof(struct entityDef));

    new->key = key;
    new->data = data;
    new->next = 0;
    data[strlen(data) - 1] = 0;		/* Nuke last " */
    /*
    fprintf(stderr, "Creating entity: %s = %s\n", key, data);
    */
    return (new);
}

/*
 * Print out the entity table.  This is used only for debugging.
 */
static void
DumpEntTable()
{
    struct entityDef *cur = topEntList;
    fprintf(stderr, "\nEntity Table (0x%x):\n", topEntList);
    while (cur) {
	fprintf(stderr, "%%%s : %s\n", cur->key, cur->data + 1);
	cur = cur->next;
    }
}

/*
 * Clean up the entity table.
 */
static void
FreeEntTable()
{
    struct entityDef *cur = topEntList;
    while (cur) {
	struct entityDef *save = cur->next;
	
	free(cur->key);
	free(cur->data);
	free(cur);
	cur = save;
    }
    topEntList = 0;
}

/***************** SGML ******************/

/*
 * Add a new SGML markup to the SGML list.
 */
static void
addSGMLTable(struct SGMLitem *new)
{
    if (topSGMLList == 0) {
	topSGMLList = new;
	bottomSGMLList = new;
    }
    else {
	bottomSGMLList->next = new;
	new->prev = bottomSGMLList;
	bottomSGMLList = new;
    }
}

/*
 * Create a new data structure for the SGML markup.
 */
static struct SGMLitem *
newSGML(char *string)
{
    struct SGMLitem *new = (struct SGMLitem *)malloc(sizeof(struct SGMLitem));

    new->str = string;
    new->next = 0;
    /*
    fprintf(stderr, "Creating SGML: %s\n", string);
    */
    return (new);
}

/*
 * Write out the SGML table.  Note that the strings in the SGML
 * list are of the standard form:
 *	<blah foo1 foo2 ... >
 * so they can be written out directly.
 */
static void
DumpSGMLTable()
{
    struct SGMLitem *cur = topSGMLList;

    while (cur) {
	fprintf(stdout, "%s\n", cur->str);
	cur = cur->next;
    }
}

